基于概念模型的仿真模型调度决策法

仿真模型调度决策是实现仿真结果合理、可信、可用的重要环节。界定了模型调度决策问题域,引入了模型调度序列表示决策结果,提出了基于UML(unified modeling language)概念模型的模型调度决策法,分析了防空作战仿真模型调度决策示例,为解决舰艇作战仿真模型的调度决策提供可行办法,对复杂军事问题仿真模型调度决策具有一定的理论意义。     

新疆高等教育资源配置的现状及问题研究

高等教育资源的合理配置是提高高校办学质量和效益的前提和关键。本文通过梳理新疆高等教育资源配置现状及存在的具体问题,进一步提出优化高等教育资源配置的对策建议,以期充分发挥高等教育在新疆社会发展中的巨大作用。     

一种基于改进的ROUSTIDA算法的数据补齐方法

针对ROUSTIDA数据补齐方法存在的问题,提出了一种改进的ROUSTIDA数据补齐方法.该方法首先将条件属性与决策属性区分对待,优先填补决策属性值,避免了不一致决策表的产生;然后,在决策属性相同的前提下填补条件属性缺失值,扩展了原算法的使用范围;最后,通过一个实例说明改进算法补齐后的决策表的确能够获得更集中的决策规则...     

面向装备作战仿真的弹药调拨供应决策建模方法研究

针对用线性规划方法在解决弹药调拨供应决策过程中存在的弹药调拨供应量的分配与弹药保障原则关联不紧密的问题,采用目标规划理论与方法,引入优先级区分主要作战方向和次要作战方向弹药库的重要程度,在同一优先级上以权重区分一梯队、二梯队及预备队弹药库的弹药保障优先顺序,使得模型的构建过程与弹药保障原则紧密相联。同时,在模型构建过程中,综合考虑了弹药消耗预测量、弹药储备标准和弹药运输时限等因素对弹药调拨供应决策的影响,并从本级弹药储备不足和充足两种情况进行了数值模型及分析,验证了模型的正确性与可靠性,为弹药调拨供应提供了决策支持与理论支撑。     

面向无人环境的机器人生态圈自主任务决策方法

借鉴自然界生态系统的典型特征,提出机器人生态圈概念。通过使集群机器人进行智能协同与复杂演化,涌现自我维持、自我复制与自我进化等生命特征,实现无人条件下的长期生存、繁衍与进化,并执行特定的任务。针对机器人生态圈典型任务场景的自主任务决策需求,分析不同机器学习任务决策方法的特点,建立机器人生态圈自主任务决策的决策树模型和神经网络模型。分析表明,两种模型的正确率均在80%~90%,且均具有良好的稳定性。这说明,机器人生态圈自主任务决策问题可以通过决策树、神经网络等机器学习方法来很好地加以解决,从而为面向无人化场景的任务应用提供技术支持。     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

全面深化改革 实现我国社会主义市场经济地位的转变

党的十八届三中全会的最大亮点和理论创新之一就是,提出了要实现市场对资源配置的决定性作用。这是思想解放的重大突破,也是深化经济体制改革以及引领其他领域改革的基本方针。阐述了改革开放35年党对市场经济地位和作用认识的历史进程,以及我国社会主义市场经济地位转变的必然性,提出了全面深化经济体制改革、实现市场经济地位转变的举措。     

LCDP SO算法在协同空战攻击决策中的运用?

为了探索提高协同空战攻击决策算法性能的途径,将多子群粒子群优化理论用于求解协同空战攻击决策,利用生命周期粒子群模型（ LCPSO）,提出了一种生命周期离散粒子群（ LCDPSO）协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。通过统计实验的方法,分析比较了LCDPSO协同空战攻击决策算法与多种智能决策算法的准确性、可靠性和快速性,研究结果证明LCDPSO协同空战攻击决策算法优良的综合性能。